Minimum degree algorithms for stability number

Minimum degree algorithms for stability number

METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...

Minimum Degree Reordering Algorithms: A Tutorial

The problem of matrix inversion is central to many applications of Numerical Linear Algebra. When the matrix to invert is dense, little can be done to avoid the costly O(n) process of Gaussian Elimination. When the matrix is symmetric, one can use the Cholesky Factorization to reduce the work of inversion (still O(n), but with a smaller coefficient). When the matrix is both sparse and symmetric...

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(∆), where ∆ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(∆). For the weighted case, we give a 4-approximation algorithm with round complexity O(∆).

Approximation Algorithms For Minimum-Cost Low-Degree Subgraphs

In this thesis we address problems in minimum-cost low-degree network design. In the design of communication networks we often face the problem of building a network connecting a large number of end-hosts. Available hardware or software often imposes additional restrictions on the topology of the network. One example for such a requirement arises in the area of computer networks: We are given a...